Maximum genus, connectivity, and Nebeský's Theorem
نویسندگان
چکیده
منابع مشابه
Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملA Brooks Type Theorem for the Maximum Local Edge Connectivity
For a graph G, let χ(G) and λ(G) denote the chromatic number of G and the maximum local edge connectivity of G, respectively. A result of Dirac implies that every graph G satisfies χ(G) 6 λ(G) + 1. In this paper we characterize the graphs G for which χ(G) = λ(G) + 1. The case λ(G) = 3 was already solved by Aboulker, Brettell, Havet, Marx, and Trotignon. We show that a graph G with λ(G) = k > 4 ...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملtoughness of the networks with maximum connectivity
the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملBipartite Graphs and Digraphs with Maximum Connectivity
Recently, some sufficient conditions for a digraph to have maximum connectivity or high superconnectivity have been given in terms of a new parameter which can be thought of as a generalization of the girth of a graph. In this paper similar results are derived for bipartite digraphs and graphs showing that, in this case, all the known conditions can be improved. As a corollary, it is shown that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2014
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.356.66e